Improving XOR-Node Placement for (+)-OBDDs
نویسندگان
چکیده
منابع مشابه
Adaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملAn Exponential Lower Bound of the Size of OBDDs Representing Division
1 Introduction The size of an OBDD [1] largely depends on the variable ordering. It is important to clarify the lower bounds of OBDDs representing arithmetic functions. In this report, we investigate a lower bound of the size of OBDDs representing integer division. More precisely, we focus on each bit of the output of the n-bit / n-bit division, and prove that the size of OBDDs representing the...
متن کاملAlgorithmic Considerations for +-OBDD Reordering
Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the process of electronic design automation. Due to limitations of the descriptive power of OBDDs more general models of Binary Decision Diagrams have been studied. In this paper, we address-OBDDs and introduce algorithms for improving their eeciency by reordering of variables and functional nodes.
متن کاملExact Minimization of Free BDDs and Its Application to Pass-Transistor Logic Optimization
In several design methods for Pass-transistor Logic (PTL) circuits, Boolean functions are expressed as OBDDs in decomposed form and then the component OBDDs are directly mapped to PTL cells. The total size of OBDDs (number of nodes) corresponds to the circuit size. In this paper, we investigate a method for PTL synthesis based on exact minimization of Free BDDs (FBDDs). FBDDs are well-studied e...
متن کاملLocal Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of the OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When-nite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Universität Trier, Mathematik/Informatik, Forschungsbericht
دوره 01-07 شماره
صفحات -
تاریخ انتشار 2001